Generic Itemset Mining Based on Reinforcement Learning

نویسندگان

چکیده

One of the biggest problems in itemset mining is requirement developing a data structure or algorithm, every time user wants to extract different type itemsets. To overcome this, we propose method, called Generic Itemset Mining based on Reinforcement Learning (GIM-RL), that offers unified framework train an agent for extracting any In GIM-RL, environment formulates iterative steps target itemsets from dataset. At each step, performs action add remove item current itemset, and then obtains reward represents how relevant resulting type. Through numerous trial-and-error where various rewards are obtained by diverse actions, trained maximise cumulative so it acquires optimal policy forming as many possible. this framework, can be long suitable defined. The extensive experiments high utility itemsets, frequent association rules show general effectiveness one remarkable potential (agent transfer) GIM-RL. We hope GIM-RL opens new research direction towards learning-based mining.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Itemset Mining Based on Cofactor Implication

(Abstract) In this paper, we propose a new method for discovering hidden information from large-scale transaction databases by considering a property of cofactor implication. Cofactor implication is an extension or generalization of symmetric itemsets, which has been presented recently. Here we discuss the meaning of cofactor implication for the data mining applications, and show an efficient a...

متن کامل

Knowledge-Based Reinforcement Learning for Data Mining

Data Mining is the process of extracting patterns from data. Two general avenues of research in the intersecting areas of agents and data mining can be distinguished. The first approach is concerned with mining an agent’s observation data in order to extract patterns, categorize environment states, and/or make predictions of future states. In this setting, data is normally available as a batch,...

متن کامل

On Minimal Infrequent Itemset Mining

A new algorithm for minimal infrequent itemset mining is presented. Potential applications of finding infrequent itemsets include statistical disclosure risk assessment, bioinformatics, and fraud detection. This is the first algorithm designed specifically for finding these rare itemsets. Many itemset properties used implicitly in the algorithm are proved. The problem is shown to be NP-complete...

متن کامل

Operation Scheduling of MGs Based on Deep Reinforcement Learning Algorithm

: In this paper, the operation scheduling of Microgrids (MGs), including Distributed Energy Resources (DERs) and Energy Storage Systems (ESSs), is proposed using a Deep Reinforcement Learning (DRL) based approach. Due to the dynamic characteristic of the problem, it firstly is formulated as a Markov Decision Process (MDP). Next, Deep Deterministic Policy Gradient (DDPG) algorithm is presented t...

متن کامل

Matrix Based Dynamic Itemset Mining Algorithm

Updates on an operational database bring forth the challenge of keeping the frequent itemsets up-to-date without re-running the itemset mining algorithms. Studies on dynamic itemset mining, which is the solution to such an update problem, have to address some challenges as handling i) updates without re-running the base algorithm, ii) changes in the support threshold, iii) new items and iv) add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2022

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2022.3141806